Componentwise perturbation analyses for the QR factorization
نویسندگان
چکیده
This paper gives componentwise perturbation analyses for Q and R in the QR factorization A = QR, QTQ = I , R upper triangular, for a given realm×nmatrixA of rank n. Such specific analyses are important for examplewhen the columns ofA are badly scaled. First order perturbation bounds are given for both Q and R. The analyses more accurately reflect the sensitivity of the problem than previous such results. The condition number for R is bounded for a fixed n when the standard column pivoting strategy is used. This strategy also tends to improve the condition of Q, so usually the computed Q and R will both have higher accuracy when we use the standard column pivoting strategy. Practical condition estimators are derived. The assumptions on the form of the perturbation∆A are explained and extended. Weaker rigorous bounds are also given.
منابع مشابه
On Mixed and Componentwise Condition Numbers for Hyperbolic Qr Factorization
We present normwise and componentwise perturbation bounds for the hyperbolic QR factorization by using a new approach. The explicit expressions of mixed and componentwise condition numbers for the hyperbolic QR factorization are derived.
متن کاملOn the perturbation of the Q-factor of the QR factorization
This paper gives normwise and componentwise perturbation analyses for the Q-factor of the QR factorization of the matrix A with full column rank when A suffers from an additive perturbation. Rigorous perturbation bounds are derived on the projections of the perturbation of the Q-factor in the range of A and its orthogonal complement. These bounds overcome a serious shortcoming of the first-orde...
متن کاملRigorous Perturbation Bounds of Some Matrix Factorizations
This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The considered componentwise perturbations have the form of backward rounding errors for the standard factorization algorithms. The used approach is a combination of the classic and refined matrix equation approaches. Each of th...
متن کاملImproved error bounds for underdetermined system solvers
The minimal 2-norm solution to an underdetermined system Ax b of full rank can be computed using a QR factorization of AT in two different ways. One method requires storage and reuse of the orthogonal matrix Q, while the method of seminormal equations does not. Existing error analyses show that both methods produce computed solutions whose normwise relative error is bounded to first order by ca...
متن کاملQR factorization with complete pivoting and accurate computation of the SVD
A new algorithm of Demmel et al. for computing the singular value decomposition (SVD) to high relative accuracy begins by computing a rank-revealing decomposition (RRD). Demmel et al. analyse the use of Gaussian elimination with complete pivoting (GECP) for computing the RRD. We investigate the use of QR factorization with complete pivoting (that is, column pivoting together with row sorting or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 88 شماره
صفحات -
تاریخ انتشار 2001